L2-optimallinear system identification Structured Total Least Squares for SISO systems
نویسندگان
چکیده
We treat the extension of Total Linear Least Squares to single-input single-output dynamic systems. It is shown that the L2-optimal model for a given dataset has some remarkable properties: The given data sequence can be decomposed into two sequences, the L2-approximations and the residuals, which are orthogonal to each other (in diagonal inner products derived from given weights). It is shown how certain block Rankel matrices Wi constructed from the weighted residuals are always rank deficient and hence, the residuals themselves can be considered as being generated by a linear system. One can find completions Wicomof the block RankeImatrices Wi with the L2-approximations, such that W,comWT = 0 (which is a more general type of orthogonality than the first one mentioned). , The results of this paper are just a special application of a general theory to approximate in a least squares sense, a given structured matrix, by one which has the same structure and is rank deficient. The main result of this theory says that, when the matrix structure is affine, the solution is generated in terms of a Riemannian SVD, which is a 'nonlinear' generalized singular value decomposition (see De Moor B., Linear Algebra and its Applications, Vo1.188-189,pp.163-207, 1993). °The following text presents research results obtained within the framework of the Belgian program me on Interuniversity Attraction Poles (IUAP-17 and IUAP-SO) initiated by the Belgian State -Prime Minister's Office Seience Policy Programming, the NFWO under contract nr. G.0292.9S (Differential geometry and matrix algorithms), the European SCIENCE project ERNSI (European Resea.rch Network for System Identification) and the European Human Capital and Mobility network SIMONET (Systems and Modelling Network). The seientific responsibility is assumed by its authors, one of which (BDM) is a. senior research assoeiate with the NFWO. 0-7803-1968-0/94$4.0001994 IEEE Berend Roorda Tinbergen Instituut Oostmaaslaan 950-952 NL 3063 DM Rotterdam The Netherlands tel: 31/10/4088932 fax: 31/10/4527347 [email protected] 1 IntroductÎon and notatÎon Let Wk E JR2, k = 0,..., N be a given vector sequence of data where the scalar sequences Uk and Yk are defined as Wk = (Uk Ykl (a superscript capital T denotes 'transpose'). One could consider the first component of Wk to be an input sequence Uk and the second component to be an output sequence Yk or the ot her way around. Our task now is to find least squares approximations Vk of the Uk, and Zk of the Yk, such that Vk and Zk are related by a linear model of given order n with real coefficients:
منابع مشابه
Adaptive pole placement by means of a simple, singularity free, identification algorithm
Reportedly, guaranteeing the controllability of the estimated system is a crucial problem in adaptive control. In this paper, we introduce a recursive least squaresbased identification algorithm for stochastic SISO systems, which secures the uniform controllability of the estimated system and presents closed-loop identification properties similar to those of the least squares algorithm. The pro...
متن کاملHigh-performance numerical algorithms and software for structured total least squares
We present a software package for structured total least-squares approximation problems. The allowed structures in the data matrix are block-Toeplitz, block-Hankel, unstructured, and exact. Combination of blocks with these structures can be specified. The computational complexity of the algorithms is O(m), where m is the sample size. We show simulation examples with different approximation prob...
متن کاملOverview of total least-squares methods
We review the development and extensions of the classical total least squares method and describe algorithms for its generalization to weighted and structured approximation problems. In the generic case, the classical total least squares problem has a unique solution, which is given in analytic form in terms of the singular value decomposition of the data matrix. The weighted and structured tot...
متن کاملAdaptive Pole Placement by Means of a Simple, Singularity Free, Identiication Algorithm
Reportedly, guaranteeing the controllability of the estimated system is a crucial problem in adaptive control. In this paper, we introduce a recursive least squares-based identiication algorithm for stochastic SISO systems , which secures the uniform controllability of the estimated system and presents closed-loop identiica-tion properties similar to those of the least squares algorithm. The pr...
متن کاملA New Recursive Identiication Algorithm for Singularity Free Adaptive Control
Reportedly, guaranteeing the controllability of the estimated system is a crucial problem in adaptive control. In this paper, we introduce a least squares-based identiication algorithm for stochastic SISO systems, which secures the uniform con-trollability of the estimated system and presents closed-loop identiication properties similar to those of the least squares algorithm. The proposed algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007